Optimal Multistage Algorithm for Adjoint Computation
نویسندگان
چکیده
منابع مشابه
Optimal Multistage Algorithm for Adjoint Computation
We reexamine the work of Stumm and Walther on multistage algorithms for adjoint computation. We provide an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on disk. Previously, optimal algorithms for adjoint computations were known only for a single level of checkpoints with no writing and reading costs; a well-known example is the binomial checkpointin...
متن کاملKaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in Kaltofen (1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Krylov subspaces, and computes the determinant as the constant term of the characteristic polynomial. For matrices over an abstract ring, by the results of Baur and Strassen (1983), the determinant algorithm, actually a s...
متن کاملA MULTISTAGE EXPANSION PLANNING METHOD FOR OPTIMAL SUBSTATION PLACEMENT
Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. In this paper optimal substation placement problem is solved using Imperialist Competitive Algorithm (ICA) as a new developed heuristic optimization algorithm. This procedure gives the optimal size, site and installation time of medium voltage substation, using their relate...
متن کاملAdjoint Computation for Hypersurfaces Using Formal Desingularizations
We show how to use formal desingularizations (defined earlier by the first author) in order to compute the global sections (also called adjoints) of twisted pluricanonical sheaves. These sections define maps that play an important role in the birational classification of schemes.
متن کاملComputation of the Adjoint Matrix
Abstract. The best method for computing the adjoint matrix of an order n matrix in an arbitrary commutative ring requires O(n log n log log n) operations, provided the complexity of the algorithm for multiplying two matrices is γn + o(n). For a commutative domain – and under the same assumptions – the complexity of the best method is 6γn/(2 − 2) + o(n). In the present work a new method is prese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2016
ISSN: 1064-8275,1095-7197
DOI: 10.1137/15m1019222